Mean square optimal NUFFT approximation for efficient non-Cartesian MRI reconstruction.
نویسندگان
چکیده
The fast evaluation of the discrete Fourier transform of an image at non-uniform sampling locations is key to efficient iterative non-Cartesian MRI reconstruction algorithms. Current non-uniform fast Fourier transform (NUFFT) approximations rely on the interpolation of oversampled uniform Fourier samples. The main challenge is high memory demand due to oversampling, especially when multidimensional datasets are involved. The main focus of this work is to design an NUFFT algorithm with minimal memory demands. Specifically, we introduce an analytical expression for the expected mean square error in the NUFFT approximation based on our earlier work. We then introduce an iterative algorithm to design the interpolator and scale factors. Experimental comparisons show that the proposed optimized NUFFT scheme provides considerably lower approximation errors than the previous designs [1] that rely on worst case error metrics. The improved approximations are also seen to considerably reduce the errors and artifacts in non-Cartesian MRI reconstruction.
منابع مشابه
Python Non-Uniform Fast Fourier Transform (PyNUFFT): multi-dimensional non-Cartesian image reconstruction package for heterogeneous platforms and applications to MRI
This paper reports the development of a Python Non-Uniform Fast Fourier Transform (PyNUFFT) package, which accelerates non-Cartesian image reconstruction on heterogeneous platforms. Scientific computing with Python encompasses a mature and integrated environment. The NUFFT algorithm has been extensively used for non-Cartesian image reconstruction but previously there was no native Python NUFFT ...
متن کاملOn NUFFT-based gridding for non-Cartesian MRI.
For MRI with non-Cartesian sampling, the conventional approach to reconstructing images is to use the gridding method with a Kaiser-Bessel (KB) interpolation kernel. Recently, Sha et al. [L. Sha, H. Guo, A.W. Song, An improved gridding method for spiral MRI using nonuniform fast Fourier transform, J. Magn. Reson. 162(2) (2003) 250-258] proposed an alternative method based on a nonuniform FFT (N...
متن کاملGridding & the NUFFT for Non-Cartesian Image Reconstruction
Introduction Typically MRI data is collected on in a rectilinear, or Cartesian, sampling pattern. Image reconstruction can then be performed with a simple 2D (or 3D) discrete Fourier transform. However, there is a long history of acquisition methods using non-Cartesian sampling patterns, going back to the very beginning of MRI. These include spiral and radial acquisition methods as shown in Fig...
متن کاملImproving Non-Cartesian MRI Reconstruction through Discontinuity Subtraction
Non-Cartesian sampling is widely used for fast magnetic resonance imaging (MRI). Accurate and fast image reconstruction from non-Cartesian k-space data becomes a challenge and gains a lot of attention. Images provided by conventional direct reconstruction methods usually bear ringing, streaking, and other leakage artifacts caused by discontinuous structures. In this paper, we tackle these probl...
متن کاملEE599 Magnetic Resonance Imaging and Reconstruction Final Project Report Jungwoo Lee (610-21-4670) Reference : An Improved Gridding Method for Spiral MRI Using Nonuniform Fast Fourier Transform
Final Project Report Jungwoo Lee (610-21-4670) Reference : An Improved Gridding Method for Spiral MRI Using Nonuniform Fast Fourier Transform Authors: Liewei Sha, Hua Guo, and Allen W.Song Introduction The objective of this project is to develop improved reconstruction algorithm using nonuniform fast Fourier transform(NUFFT) for spiral MRI. In conventional gridding methods, while explicit forms...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of magnetic resonance
دوره 242 شماره
صفحات -
تاریخ انتشار 2014